Solving Capacitated Vehicle Routing Problem (CVRP) for the Environments with Circular Obstacles

In capacitated vehicle routing problem (CVRP), a fleet of vehicles with certain capacity starts at central depot and returns to this starting point after serving some customers by using the optimal set routes minimum cost. However, in real-life, environments may include obstacles such as holes, machines, or trees different sizes. research, CVRP extension is proposed that classical one for various sized circular obstacles. To solve problem, hybrid meta-heuristic algorithm based on genetic algorithms improved local search was developed. Additionally, visual simulation tool designed place locations working space. The developed tested customer-obstacle counts obstacle sizes occupancies environment. results obtained are presented problem’s potential applications discussed.